Numerical radius inequality for C0 contractions

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Spectral Radius Algebras and C0 Contractions

We consider spectral radius algebras associated to C0 contractions. When the operator A is algebraic, we describe all invariant subspaces that are common for operators in its spectral radius algebra BA. In all other situations BA is weakly dense and we characterize a set of rank one operators in BA that is weakly dense in L(H).

متن کامل

On the Reflextvtty of C0(n) Contractions

Let T be a CQ(N) contraction on a separable Hubert space and let / — S(qPi) ffi S(<p¿) © • • ■ ®5(qpt) be its Jordan model, where m„ qpj,.. ., <pk are inner functions satisfying <ty|m,_i for j = 2, 3,..., k, and S(<fj) denotes the compression of the shift on H2 Q <PjH2,j 1, 2,..., k. In this note we show that T is reflexive if and only if S^/ipi) is. In this note we only consider bounded linear...

متن کامل

extend numerical radius for adjointable operators on Hilbert C^* -modules

In this paper, a new definition of numerical radius for adjointable operators in Hilbert -module space will be introduced. We also give a new proof of numerical radius inequalities for Hilbert space operators.

متن کامل

Characterization of the Unbounded Bicommutant of C0(n) Contractions

Recent results have shown that any closed operator A commuting with the backwards shift S∗ restricted to K u := H 2 ⊖ uH, where u is an inner function, can be realized as a Nevanlinna function of S∗ u := S ∗| K2 u , A = φ(S∗ u), where φ belongs to a certain class of Nevanlinna functions which depend on u. In this paper this result is generalized to show that given any contraction T of class C0(...

متن کامل

On the Inequality between Radius and Randić Index for Graphs

The Randić index R(G) of a graph G is the sum of weights (deg(u) deg(v))−0.5 over all edges uv of G, where deg(v) denotes the degree of a vertex v. Let r(G) be the radius of G. We prove that for any connected graph G of maximum degree four which is not a path with even number of vertices, R(G) ≥ r(G). As a consequence, we resolve the conjecture R(G) ≥ r(G)− 1 given by Fajtlowicz in 1988 for the...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Linear Algebra and its Applications

سال: 2009

ISSN: 0024-3795

DOI: 10.1016/j.laa.2007.11.017